On the distribution of angles between the N shortest vectors in a random lattice
نویسنده
چکیده
We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n-dimensional lattice as n → ∞. Moreover we interpret the result in terms of eigenvalues and eigenfunctions of the Laplacian on flat tori. Finally we discuss the limit distribution of any finite number of successive minima of a random n-dimensional lattice as n → ∞.
منابع مشابه
On the Distribution of Lengths of Short Vectors in a Random Lattice
We use an idea from sieve theory to estimate the distribution of the lengths of kth shortest vectors in a random lattice of covolume 1 in dimension n. This is an improvement of the results of Rogers [3] and Södergren [5] in that it allows k to increase with n.
متن کاملMagnetic Properties in a Spin-1 Random Transverse Ising Model on Square Lattice
In this paper we investigate the effect of a random transverse field, distributed according to a trimodal distribution, on the phase diagram and magnetic properties of a two-dimensional lattice (square with z=4), ferromagnetic Ising system consisting of magnetic atoms with spin-1. This study is done using the effectivefield theory (EFT) with correlations method. The equations are derived using...
متن کاملOn Nearly Orthogonal Lattice Bases and Random Lattices
We study lattice bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least π 3 radians; we denote such bases as “nearly orthogonal.” We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, we prove that if the basis vector lengths are “nearly equal,” then the basis is the unique nearly orthog...
متن کاملFaster algorithms for SVP and CVP in the $\ell_{\infty}$ norm
Blomer and Naewe[BN09] modified the randomized sieving algorithm of Ajtai, Kumar and Sivakumar[AKS01] to solve the shortest vector problem (SVP). The algorithm starts with $N = 2^{O(n)}$ randomly chosen vectors in the lattice and employs a sieving procedure to iteratively obtain shorter vectors in the lattice. The running time of the sieving procedure is quadratic in $N$. We study this problem ...
متن کاملSpatial statistics for lattice points on the sphere I: Individual results
We study the spatial distribution of point sets on the sphere obtained from the representation of a large integer as a sum of three integer squares. We examine several statistics of these point sets, such as the electrostatic potential, Ripley's function, the variance of the number of points in random spherical caps, and the covering radius. Some of the results are conditional on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. London Math. Society
دوره 84 شماره
صفحات -
تاریخ انتشار 2011